Prony-Type Polynomials and Their Common Zeros
نویسندگان
چکیده
منابع مشابه
Polynomials with integer coefficients and their zeros
We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to the approximation by polynomials with integer coefficients, and to the growth of coefficients for polynomials with roots located in prescribed sets. The distribution of zeros for...
متن کاملBounding the number of common zeros of multivariate polynomials and their consecutive derivatives
We upper bound the number of common zeros over a finite grid of multivariate polynomials and an arbitrary finite collection of their consecutive Hasse derivatives (in a coordinate-wise sense). To that end, we make use of the tool from Gröbner basis theory known as footprint. Then we establish and prove extensions in this context of a family of well-known results in algebra and combinatorics. Th...
متن کاملFirst and second kind paraorthogonal polynomials and their zeros
Given a probability measure μ with infinite support on the unit circle ∂D = {z : |z| = 1}, we consider a sequence of paraorthogonal polynomials hn(z, λ) vanishing at z = λ where λ ∈ ∂D is fixed. We prove that for any fixed z0 6∈ supp(dμ) distinct from λ, we can find an explicit ρ > 0 independent of n such that either hn or hn+1 (or both) has no zero inside the disk B(z0, ρ), with the possible e...
متن کاملPolynomials associated with Partitions: Their Asymptotics and Zeros
Let pn be the number of partitions of an integer n. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting behavior of their zeros as sets and densities.
متن کاملZeros of Polynomials and their Applications to Theory: A Primer
Problems in many different areas of mathematics reduce to questions about the zeros of complex univariate and multivariate polynomials. Recently, several significant and seemingly unrelated results relevant to theoretical computer science have benefited from taking this route: they rely on showing, at some level, that a certain univariate or multivariate polynomial has no zeros in a region. Thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Applied Mathematics and Statistics
سال: 2020
ISSN: 2297-4687
DOI: 10.3389/fams.2020.00016